Pii: S0969-6016(00)00023-x
نویسندگان
چکیده
The critical path method remains one of the most popular approaches in practical scheduling. Being developed for the makespan problem this method can also be generalized to the maximum lateness problem. For the unit execution time task system and parallel processors this generalization is known as the Brucker±Garey±Johnson algorithm. We characterize this algorithm by introducing an upper bound on the deviation of the criterion from its optimal value. The bound is stated in terms of parameters characterizing the problem, namely number of processors, the length of the longest path, and the total required processing time. We also derive a similar bound for the preemptive version of the Brucker± Garey±Johnson algorithm. 7 2000 IFORS. Published by Elsevier Science Ltd. All rights reserved.
منابع مشابه
Pii: S0969-6016(00)00028-9
We view group decision making as a collaborative process, where decision makers can establish a common belief on the dimensions of the problem by following a series of well-de®ned communicative actions. Having ®rst de®ned these actions, this paper reports on the exploitation of recent advances in information and communication technology, which can be used to: (i) remove the communication impedi...
متن کاملPii: S0969-6016(00)00022-8
Despite the popularity of the ``learning'' curve, it should be called the ``forecasting'' curve. Given an industrial process, the traditional learning curve forecasts how costs are expected to decline (or other performance measures improve) in the future. Forecasting is certainly very useful. Nevertheless, the previous literature is notably mute on how the improvement or learning occurs. Withou...
متن کاملPii: S0026-2692(00)00023-9
In this paper we analyse the trade-offs for a terahertz imaging system and discuss implementation of a terahertz micro antenna array for imaging. We also describe applications of terahertz imaging and improvements in the signal processing. q 2000 Elsevier Science Ltd. All rights reserved.
متن کاملPii: S0925-7721(00)00023-7
It is shown that in any polygonal art gallery of n sides it is possible to place bn/3c point guards whose range of vision is 180◦ so that every interior point of the gallery can be seen by at least one of them. The guards can be stationed at any point of the art gallery. This settles an open problem posed by J. Urrutia. 2000 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000